A Parallel Approach to Hierarchical Radiosity

Parallel Hierarchical Radiosity: The PIT Approach

Radiosity is a method to compute the global illumination of a scene characterized by high computational requirements. To reduce this complexity, hierarchical radiosity decomposes the scene into a hierarchy of patches and computes the light exchange at different levels, according to the distance between patches and/or to the amount of light emitted by the patches. A distributed memory implementa...

Data-Parallel Hierarchical Link Creation for Radiosity

The efficient simulation of mutual light exchange for radiosity-like methods has been demonstrated on GPUs. However, those approaches require a suitable set of links and hierarchical data structures, prepared in an expensive preprocessing step. We present a fast, data-parallel method to create links and a compact tree of patches. We demonstrate our approach for Antiradiance and Implicit Visibil...

Parallel Hierarchical Radiosity Algorithms : Case Study on a Dsm-coma Architecture Parallel and Distributed Computing Laboratory

Spatial Partitioning For Hierarchical Radiosity

This work resides around the interface of two disciplines in computer science: computer graphics (global illumination) and parallel computing (dynamic partitioning). On the one hand an efficient algorithm for global illumination simulation – hierarchical radiosity – is examined with respect to its capability of being parallelized. On the other hand we develop a general tool T for the dynamic pa...

Efficient Parallel Refinement for Hierarchical Radiosity on a DSM computer

We introduce a simple, yet efficient extension to the hierarchical radiosity algorithm for the simulation of global illumination, taking advantage of a distributed shared memory (DSM) parallel architecture. Our task definition is based on a very fine grain decomposition of the refinement process at the level of individual pairs of hierarchical elements, therefore allowing a very simple implemen...